An ID-based Hierarchical Access Control Scheme with Constant Size Public Parameter

نویسندگان

  • Rang Zhou
  • Chunxiang Xu
  • Wanpeng Li
  • Jining Zhao
چکیده

Many ways are proposed to reduce the secret storage space of access control in hierarchy, but no one optimizes the public parameters which are only modified by CA. Length of each public parameter is one important factor for the size and utilization of storage space. The frequent changes on the maximum length of public parameter will be a weakness for stability, in dynamic key management. Number and length of changed public parameter are considered for the interaction between CA and trusted public platform in dynamic management. The paper proposes an improved scheme to optimize storage space of public parameter for each class from variable linear size to a small constant size. Our scheme has higher utilization, stability and efficiency on storage space of trusted public platform and needs less interaction between CA and trusted public platform. The security of this improved scheme is proved on key recovery model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved (Hierarchical) Inner-Product Encryption from Lattices

Inner-product encryption (IPE) provides fine-grained access control and has attractive applications. Agrawal, Freeman, and Vaikuntanathan (Asiacrypt 2011) proposed the first IPE scheme from lattices by twisting the identity-based encryption (IBE) scheme by Agrawal, Boneh, and Boyen (Eurocrypt 2010). Their IPE scheme supports inner-product predicates over Rμ , where the ring is R = Zq . Several ...

متن کامل

Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts

Efficient and privacy-preserving constructions for search functionality on encrypted data is important issues for data outsourcing, and data retrieval, etc. Fully secure anonymous Hierarchical ID-Based Encryption (HIBE) schemes is useful primitives that can be applicable to searchable encryptions [4], such as ID-based searchable encryption, temporary searchable encryption [1], and anonymous for...

متن کامل

Constant-Size Hierarchical Identity-Based Signature/Signcryption without Random Oracles

We construct the first constant-size hierarchical identity-based signature (HIBS) without random oracles the signature size is O(λs) bits, where λs is the security parameter, and it is independent of the number of levels in the hierarchy. We observe that an efficient hierarchical identity-based signcryption (HIBSC) scheme without random oracles can be compositioned from our HIBS and Boneh, Boye...

متن کامل

On (Hierarchical) Identity Based Encryption Protocols with Short Public Parameters (With an Exposition of Waters' Artificial Abort Technique)

At Eurocrypt 2005, Waters proposed an efficient identity based encryption (IBE) scheme. One drawback of this scheme is that the size of the public parameter is rather large. Our first contribution is a generalization of Waters scheme. In particular, we show that there is an interesting trade-off between the tightness of the security reduction and smallness of the public parameter size. For a gi...

متن کامل

Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption

A forward-secure encryption scheme protects secret keys from exposure by evolving the keys with time. Forward security has several unique requirements in hierarchical identity-based encryption (HIBE) scheme: (1) users join dynamically; (2) encryption is joining-time-oblivious; (3) users evolve secret keys autonomously. We define and construct a scalable pairing-based forward-secure HIBE (fsHIBE...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Network Security

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2016